Fast and Robust Stereo Matching Algorithms for Mining Automation
نویسندگان
چکیده
منابع مشابه
Fast and Robust Stereo Matching Algorithms for Mining Automation
NOTICE: this is the author’s version of a work that was accepted for publication in Digital Signal Processing. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive vers...
متن کاملFast Algorithms for Stereo Matching and Motion Estimation
This paper presents fast algorithms for similarity measure, stereo matching, panoramic stereo matching, and image motion estimation. The disparity map for the stereo images is found in the 3D correlation coefficient volume by obtaining the global 3D maximumsurface by using our two-stage dynamic programming (TSDP) technique. Fast panoramic stereo matching is carried out using a cylindrical maxim...
متن کاملFast and robust semi-local stereo matching using possibility distributions
Global stereo matching methods aim to reduce the sensibility of stereo correspondence to ambiguities caused by occlusions, poor local texture or fluctuation of illumination. However, when facing the problem of real-time stereo matching, as in robotic vision, local algorithms are known to be the best. In this paper, we propose a semi-local stereo matching algorithm (SLSM algorithm); an area-base...
متن کاملFast Edge-Based Stereo Matching Algorithms through Search Space Reduction
Finding corresponding edges is considered being the most difficult part of edge-based stereo matching algorithms. Usually, correspondence for a feature point in the first image is obtained by searching in a predefined region of the second image, based on epipolar line and maximum disparity. Reduction of search region can increase performances of the matching process, in the context of execution...
متن کاملFast Multi-labelling for Stereo Matching
We describe a new fast algorithm for multi-labelling problems. In general, a multi-labelling problem is NP-hard. Widely used algorithms like α-expansion can reach a suboptimal result in a time linear in the number of the labels. In this paper, we propose an algorithm which can obtain results of comparable quality polynomially faster. We use the Divide and Conquer paradigm to separate the comple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Digital Signal Processing
سال: 1999
ISSN: 1051-2004
DOI: 10.1006/dspr.1999.0337